Welcome to Punggol Map Development. This map is for development purposes.
Walking and Driving graph is mainly used with A* heuristics to ensure that every node travelled will be towards the destination. The algorithm will discard nodes that might be the Minimum but is heading away from the destination.
Bus and LRT routes will mainly be using the Dijkstra with minHeap without Heuristics as buses or LRT could be travelling away from the destination as it traverse the nodes. Most importantly, the weight of the edges determines the shortest route. An example wil be a user can find the shortest route to the destination via bus which could indicate that the number of transfers do not matter. As such, cost of transfer will be set to 0. Whereas to determine the least transfer in a route, the cost of transfer between each buses is set to 9999 to indicate the cost to be expensive per each transfer. This is to minimize any unnecessary transfers and to always stay on the same bus.
Lastly, a DOUBLE HASH TABLE is utilize as the data structres of handling the nodes to improve time complexity.
Dependencies:
Algorithms/Data structures:
Worst-Case Complexity:
If you wish to contribute or for more information, please visit our site.
{{directions|linebreaksbr}}
{{distances}}
{{transfers}}